A Computational Interpretation of the Axiom of Determinacy in Arithmetic
نویسنده
چکیده
We investigate the computational content of the axiom of determinacy (AD) in the setting of classical arithmetic in all finite types with the principle of dependent choices (DC). By employing the notion of realizability interpretation for arithmetic given by Berardi, Bezem and Coquand (1998), we interpret the negative translation of AD. Consequently, the combination of the negative translation with this realizability semantics can be seen as a model of DC, AD and the negation of the axiom of choice at higher types. In order to understand the computational content of AD, we explain, employing Coquand’s game theoretical semantics, how our realizer behaves. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
The Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength
We prove that determinacy for all Boolean combinations of Fσδ (Π 0 3) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Πn-comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the diff...
متن کاملThe Simulation Technique and Its Applications to Infinitary Combinatorics under the Axiom of Blackwell Determinacy
The Axiom of Blackwell Determinacy is a set-theoretic axiom motivated by games used in statistics. It is known that the Axiom of Determinacy implies the Axiom of Blackwell Determinacy. Tony Martin has conjectured that the two axioms are equivalent. We develop the “simulation technique” which allows us to simulate boundedness proofs under the assumption of Blackwell Determinacy and deduce strong...
متن کاملCountable Dense Homogeneity of Definable Spaces
We investigate which definable separable metric spaces are countable dense homogeneous (CDH). We prove that a Borel CDH space is completely metrizable and give a complete list of zero-dimensional Borel CDH spaces. We also show that for a Borel X ⊆ 2 the following are equivalent: (1) X is Gδ in 2 ω , (2) X is CDH and (3) X is homeomorphic to 2 or to ω . Assuming the Axiom of Projective Determina...
متن کاملA parametrised choice principle and Martin's conjecture on Blackwell determinacy
Tony Martin proved in [Mar98] that the Axiom of Determinacy AD implies the Axiom of Blackwell Determinacy Bl-AD, and conjectured that the converse holds as well: Conjecture 1 The Axiom of Blackwell Determinacy Bl-AD implies the Axiom of Determinacy AD. Although Martin, Neeman and Vervoort in their [MarNeeVer03] have made considerable progress on Martin’s Conjecture 1, the full conjecture remain...
متن کاملThe axiom of real Blackwell determinacy
The theory of infinite games with slightly imperfect information has been focusing on games with finitely and countably many moves. In this paper, we shift the discussion to games with uncountably many possible moves, introducing the axiom of real Blackwell determinacy Bl-ADR (as an analogue of the axiom of real determinacy ADR). We prove that the consistency strength of Bl-ADR is strictly grea...
متن کامل